فیلترها/جستجو در نتایج    

فیلترها

سال

بانک‌ها



گروه تخصصی











متن کامل


نویسنده: 

KHALOU KAKAEI R.

اطلاعات دوره: 
  • سال: 

    2005
  • دوره: 

    1
تعامل: 
  • بازدید: 

    2257
  • دانلود: 

    0
چکیده: 

Before starting the operation in open pit mining, it is necessary to design the size and final shape of the pit in order to determine minable reserves and amount of waste to be removed. It is also needed to locate the waste dump, processing plant and other surface facilities. The pit limit, which is a function of numerous variables, may be re-evaluated many times during the life of the mine as design parameters change or more information is obtained during the operation. Therefore the use of a computer is necessary in order to design the pit as rapidly as possible. With the advent and wide spread use of computers a number of algorithms such as the Floating or moving Cone method, Lerchs & Grossmann algorithm based on graph theory and .... have been developed to determine the optimum ultimate pit limits. Among these the Lerchs-Grossmann algorithm is the only method that always to yield the true optimum pit. The disadvantages of the algorithm are complexity of the method and require more computing time than other methods to reach a solution. The Floating Cone approach which does not yield a true optimum pit in some cases is the most popular and simplest method and requires significantly less computing time than any other method to reach a solution. The moving Cone II has been developed by Wright to overcome the shortfalls of the Floating Cone method. This paper evaluates the moving Cone II for being as a true optimum open pit design method. For this purpose a C++ computer program has been developed based on this algorithm and the results are compared with the Lerchs and Grossmann method, which is the true optimum open pit design algorithm.

شاخص‌های تعامل:   مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

بازدید 2257

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resourcesدانلود 0
نویسندگان: 

خالوکاکایی رضا

اطلاعات دوره: 
  • سال: 

    1386
  • دوره: 

    41
  • شماره: 

    3 (پیاپی 105)
  • صفحات: 

    297-307
تعامل: 
  • استنادات: 

    0
  • بازدید: 

    2324
  • دانلود: 

    733
چکیده: 

پس از اختراع کامپیوتر و استفاده همه جانبه آن، الگوریتم های مختلفی جهت طراحی محدوده بهینه نهایی معادن روباز ارایه شده است که هدف اصلی همه آنها پیدا کردن مجموعه بلوک هایی است که اگر استخراج شوند، سود بهدست آمده تحت محدودیت های فنی و اقتصادی حداکثر شود. مهمترین الگوریتم های مختلف طراحی محدوده بهینه نهایی در معادن روباز عبارتند از: روش تئوری گراف لرچ و گروسمن، الگوریتم کوروبوف و روش های اصلاح شده آن، روش مخروط شناور، روش مخروط شناور دو و برنامه ریزی پویا. از میان این الگوریتم ها، روش تئوری گراف لرچ و گروسمن تنها روشی است که قادر است محدوده بهینه واقعی را در تمام مدل ها محاسبه نماید. پیچیدگی این روش و نیاز به وقت کامپیوتری زیاد جهت حصول به جواب از معایب روش مذکور می باشد. روش مخروط شناور به دلیل اینکه در مدت زمان کمتری قادر است محدوده بهینه را محاسبه نماید و همچنین به دلیل سادگی، بیشتر از سایر الگوریتم ها استفاده می شود. این الگوریتم در بعضی از حالات قادر به تعیین محدوده بهینه واقعی نیست. به همین دلیل روش مخروط شناور دو برای برطرف نمودن بعضی از معایب روش مذکور توسط رایت ارایه و ادعا شده است که این روش قادر به تعیین محدوده بهینه واقعی می باشد. در این مقاله روش مخروط شناور دو برای بهینه بودن، مورد بررسی قرار گرفته است. نتایج نشان می دهد که روش مذکور در بعضی از حالات قادر به محاسبه محدوده بهینه واقعی نیست. همچنین دو الگوریتم مختلف برای اصلاح روش مذکور ارایه گردید و سپس برنامه های کامپیوتری لازم به زبان برنامه نویسی C++ در محیط ویندوز تهیه شد و کارایی روش های مذکور برای مدل های مختلف بررسی و نتایج آن با نتایج حاصل از روش تئوری گراف لرچ و گروسمن مقایسه گردید. نتایج نشان می دهد که الگوریتم های ارایه شده جواب های بهتری به دست می آورند.

شاخص‌های تعامل:   مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

بازدید 2324

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resourcesدانلود 733 مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resourcesاستناد 0 مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resourcesمرجع 0
اطلاعات دوره: 
  • سال: 

    2021
  • دوره: 

    55
  • شماره: 

    1
  • صفحات: 

    41-46
تعامل: 
  • استنادات: 

    0
  • بازدید: 

    78
  • دانلود: 

    0
چکیده: 

In this paper, the flashlight (FL) algorithm, which is categorized as a heuristic method, has been suggested to determine the ultimate pit limit (UPL). In order to apply the suggested algorithm and other common algorithms, such as the dynamic programming, the Korobov, and the Floating Cone, and to validate the capability of the proposed method, the ultimate pit limit was determined in a cross-section of the Korkora reserve, which is located in Kurdistan province, northwestern of Iran and consists of 3080 blocks. The comparison of the FL algorithm and other methods revealed that same as high accuracy dynamic programming methods, the proposed algorithm could find the optimum value, while the Korobov and the Floating Cone algorithms failed to determine the optimum limit.

شاخص‌های تعامل:   مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

بازدید 78

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resourcesدانلود 0 مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resourcesاستناد 0 مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resourcesمرجع 0
مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources
اطلاعات دوره: 
  • سال: 

    2023
  • دوره: 

    57
  • شماره: 

    1
  • صفحات: 

    55-58
تعامل: 
  • استنادات: 

    0
  • بازدید: 

    31
  • دانلود: 

    0
چکیده: 

The large-scale open-pit mine production planning problem is an NP-hard issue. That is, it cannot be solved in a reasonable computational time. To solve this problem, various methods, including metaheuristic methods, have been proposed to reduce the computation time. One of these methods is the genetic algorithm (GA) which can provide near-optimal solutions to the problem in a shorter time. This paper aims to evaluate the efficiency of the GA technique based on the pit values and computational times compared with other methods of designing the ultimate pit limit (UPL). In other words, in addition to GA evaluation in UPL design, other proposed methods for UPL design are also compared. Determining the UPL of an open-pit mine is the first step in production planning. UPL solver selects blocks whose total economic value is maximum while meeting the slope constraints. In this regard, various methods have been proposed, which can be classified into three general categories: Operational Research (OR), heuristic, and metaheuristic. The GA, categorized as a metaheuristic method, Linear Programming (LP) model as an OR method, and Floating Cone (FC) algorithm as a heuristic method, have been employed to determine the UPL of open-pit mines. Since the LP method provides the exact answer, consider the basics. Then the results of GA were validated based on the results of LP and compared with the results of FC. This paper used the Marvin mine block model with characteristics of 53271 blocks and eight levels as a case study. Comparing the UPL value's three ways revealed that the LP model received the highest value by comparing the value obtained from GA and the FC algorithm's lowest value. However, the GA provided the results in a shorter time than LP, which is more critical in large-scale production planning problems. By performing the sensitivity analysis in the GA on the two parameters, crossover and mutation probability, the GA's UPL value was modified to 20940. Its UPL value is only 8% less than LP's UPL value.

شاخص‌های تعامل:   مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

بازدید 31

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resourcesدانلود 0 مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resourcesاستناد 0 مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resourcesمرجع 0
اطلاعات دوره: 
  • سال: 

    2021
  • دوره: 

    11
  • شماره: 

    2
  • صفحات: 

    143-150
تعامل: 
  • استنادات: 

    0
  • بازدید: 

    88
  • دانلود: 

    0
چکیده: 

Background: The use of small fields has increased by the emergence of advanced radiotherapy. Dose calculations of these fields are complex and challenging for many reasons such as lack of electrical equilibrium even in homogeneous environments, and this complexity will increase in presence of heterogeneity. According to the importance of delivery the accurate prescription dose to the target volume in the patient’ s body, the dose calculation accuracy of used commercial algorithms in clinical treatment planning systems (TPS) should be evaluated. Objective: The present study aims to evaluate the accuracy of Collapsed-Cone dose measurement algorithm in Isogray treatment planning system. Material and Methods: In this analytical study, the measurements were made in tissue equivalent solid water phantom with lung and bone heterogeneities by Pinpoint dosimeter (0. 015 cm3 sensitive volume) in several radiation fields (1×1 to 5×5 cm2). The phantoms were irradiated with 6, 10 and 18 MV photon beams and finally, the results of experimental calculations were compared with treatment planning outputs. Results: In all setups, the maximum deviation occurred in the field of 1×1 cm2. Then, the maximum deviation was observed for 2×2 cm2 field size; however, it was up to 5% for homogeneous water phantom and lung heterogeneity. In 3×3 cm2 and larger fields, there was a good agreement between the results of the TPS and experimental dosimetry. The maximum deviation was observed in water-bone heterogeneity. Conclusion: This algorithm was able to pass the standard audit criteria, but it is better to be used more cautiously in bone heterogeneity, especially in low energies.

شاخص‌های تعامل:   مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

بازدید 88

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resourcesدانلود 0 مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resourcesاستناد 0 مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resourcesمرجع 0
نویسندگان: 

ZANGIABADI M. | MANSOURI H. | PIRHAJI M.

اطلاعات دوره: 
  • سال: 

    2016
  • دوره: 

    1
  • شماره: 

    4
  • صفحات: 

    103-114
تعامل: 
  • استنادات: 

    0
  • بازدید: 

    353
  • دانلود: 

    0
چکیده: 

In this paper, we propose a feasible interior-point algorithm for mixed symmetric Cone linear complementarity problems which are a general class of complementarity problems. The symmetrization of the search directions used in this paper is based on Nesterov and Todd scaling scheme. By using Euclidean Jordan algebra, we prove the convergence analysis of the proposed algorithm and show that the complexity bound of the algorithm matches the currently best known iteration bound for feasible interior-point methods.

شاخص‌های تعامل:   مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

بازدید 353

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resourcesدانلود 0 مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resourcesاستناد 0 مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resourcesمرجع 0
مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources
اطلاعات دوره: 
  • سال: 

    2023
  • دوره: 

    13
  • شماره: 

    3
  • صفحات: 

    191-198
تعامل: 
  • استنادات: 

    0
  • بازدید: 

    12
  • دانلود: 

    0
چکیده: 

Background: Virtual wedge (VW) is used in radiotherapy to compensate for missing tissues and create a uniform dose distribution in tissues. According to TECDOC? 1583 and technical reports series no. 430, evaluating the dose calculation accuracy is essential for the quality assurance of treatment planning systems (TPSs). In this study, the dose calculation accuracy of the collapsed Cone superposition (CCS) algorithm in the postmastectomy radiotherapy of the chest wall for breast cancer was evaluated by comparing the calculated and measured dose in VW fields. Methods: Two tangential fields with the typical VW angles were planned using ISOgray TPS in a thorax phantom. The CCS algorithm was used for dose calculation at 6 and 15 MV photon beams. The obtained dose distributions from EBT3 film spaces and TPS were evaluated using the gamma index. Results: The measured and calculated dose values using VW in a heterogeneous medium with different beam energies were in a good agreement with each other (acceptance rate: 88. 0%-93. 4%). The calculated and measured data did not differ significantly with an increase/decrease in wedge angle. In addition, the results demonstrated that ISOgray overestimated and underestimated the dose of the soft tissue and lung in the planned volume, respectively. Conclusions: According to the results of gamma index analysis, the calculated dose distribution using VW model with the CCS algorithm in a heterogeneous environment was within acceptable limits

شاخص‌های تعامل:   مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

بازدید 12

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resourcesدانلود 0 مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resourcesاستناد 0 مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resourcesمرجع 0
نویسندگان: 

KHEIRFAM B. | MAHDAVI AMIRI N.

اطلاعات دوره: 
  • سال: 

    2014
  • دوره: 

    40
  • شماره: 

    3
  • صفحات: 

    541-564
تعامل: 
  • استنادات: 

    0
  • بازدید: 

    433
  • دانلود: 

    0
چکیده: 

A full Nesterov-Todd (NT) step infeasible interior-point algorithm is proposed for solving monotone linear complementarity problems over symmetric Cones by using Euclidean Jordan algebra. Two types of full NT-steps are used, feasibility steps and centering steps. The algorithm starts from strictly feasible iterates of a perturbed problem, and, using the central path and feasibility steps, finds strictly feasible iterates for the next perturbed problem. By using centering steps for the new perturbed problem, strictly feasible iterates are obtained to be close enough to the central path of the new perturbed problem. The starting point depends on two positive numbers rp and rd. The algorithm terminates either by finding an e-solution or detecting that the symmetric Cone linear complementarity problem has no optimal solution with vanishing duality gap satisfying a condition in terms of rp and rd. The iteration bound coincides with the best known bound for infeasible interior-point methods.

شاخص‌های تعامل:   مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

بازدید 433

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resourcesدانلود 0 مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resourcesاستناد 0 مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resourcesمرجع 0
اطلاعات دوره: 
  • سال: 

    1401
  • دوره: 

    13
  • شماره: 

    2
  • صفحات: 

    83-104
تعامل: 
  • استنادات: 

    0
  • بازدید: 

    63
  • دانلود: 

    13
چکیده: 

پدیده شناورسازی سور که در آن سور از گروه حرف تعریف مرتبطش جدا است، تحلیل­ های مختلفی از جانب زبان­ شناسان گوناگون داشته است که مهم­ ترین آن­ها تحلیل قیدی و رهاسازی است. در مقاله حاضر به هر دو تحلیل اشاره شده و با داده­ هایی از زبان فارسی تحلیل قیدی کنار گذاشته می ­شود. در تحلیل رهاسازی عقیده بر این است که ساخت ­های حاوی سور شناور و ساخت ­های حاوی سور غیرشناور دارای زیرساختی یکسان هستند، به این صورت که سور و گروه حرف تعریف در ابتدا با هم سازه­ای واحد را شکل می­دهند و سپس در نتیجۀ جابجایی گروه حرف تعریف از درون این سازۀ واحد، سور همان­جا رها شده و شناور می­ گردد. مقاله حاضر با استفاده از شواهدی نشان می­ دهد که این دو ساخت برخلاف تصور رایج رویکرد رهاسازی، هر کدام ساختاری مستقل از دیگری دارد. در ساختاری که برای ساخت­ های حاوی سور شناور مطرح ­می­شود، سور شناور افزوده­ای به گروه حرف تعریف مرتبطش است که با فرآیند افزودگی متاخر وارد اشتقاق می ­شود: یعنی ابتدا گروه حرف تعریف در جایگاه موضوع ادغام شده و سپس به جایگاهی بالاتر حرکت می­ کند و در این جایگاه دوم سور به آن افزوده می ­شود. در چارچوب الگوریتم برچسب­گذاری نشان می­دهیم سوری که در چنین ساختاری قرار دارد و افزودۀ گروه حرف تعریف است، اجباراً شناور می­ شود، چرا که ساختار حاصل از افزوده شدن سور به گروه حرف تعریف، برای پذیرفتن برچسبی به منظور دریافت تعبیر معنایی، نیازمند یک جابجایی از درون این ساختار است؛ بنابراین گروه حرف تعریف اجباراً جابجا شده و سور به صورت شناور رها می­ شود. در همین چارچوب، تنها ساختار قابل قبول برای ساخت­ های حاوی سور غیرشناور نیز ساختاری معرفی شده که در آن گروه حرف تعریف متمم و خواهر هستۀ سور است. نشان می­ دهیم در چنین ساختاری به علت فاز بودن گروه سور، گروه حرف تعریف به عنوان متمم آن، امکان جابجایی ندارد و در نتیجه، سور در چنین ساختی اجباراً غیرشناور می­ ماند

شاخص‌های تعامل:   مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

بازدید 63

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resourcesدانلود 13 مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resourcesاستناد 0 مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resourcesمرجع 0
نویسنده: 

Naghipur M.

اطلاعات دوره: 
  • سال: 

    1990
  • دوره: 

    1
تعامل: 
  • بازدید: 

    292
  • دانلود: 

    0
چکیده: 

IN ORDER TO CONNECT THE LAND AND THE SEA FOR CARGO AND PASSENGER TRANSPORTATION, IT IS NECESSARY TO CONSTRUCT TERMINALS IN SUITABLE DISTANCES OF THE COAST. THE EXISTENCE OF SEA TIDES AND ACCESS TO AN ADEQUATE WATER DEPTH FOR THE SHIPS TO BERTH ON THE ONE HAND SEEMS NECESSARY FOR TERMINALS TO BE CONNECTED TO THE LAND, AND ON THE OTHER, THEY SHOULD BE Floating TO MOVE UP OR DOWN USING THE JACK-UP SYSTEMS. THE Floating SYSTEM IS PREFERRED TO THE JACK-UP SYSTEM DUE TO ITS SIMPLICITY AND THE OBTAINED EXPERIENCE. MOREOVER, THE CURRENT SYSTEM IS USED IN OFFSHORE STRUCTURES BECAUSE OF ITS PARTICULAR FEATURES. THE STRUCTURE USED FOR THIS PURPOSE IS T-SHAPED, WHICH IS FULLY BOLSTERED ON SPANS AND HAS RESILIENT BOLSTER ON ITS Floating SIDE. THE SURFACE IS MADE OF METAL SHEETS AND ITS INTERIOR ELEMENTS ARE OF TRUSS (DUAL-FORCE) PARTS, WHICH ARE CONNECTED TO EACH OTHER IN A PYRAMID STYLE, IN ORDER TO FACILITATE MOORING AND SHIP OPERATIONS. IN ADDITION TO THE LATERAL LOADS SUCH AS WAVES, WIND, CURRENT, THE FORCES OF MOORING AND PIERS, THIS STRUCTURE BEARS THE DYNAMIC LOADS OF THE VEHICLES SUCH AS TRAILERS, TRUCKS, TANKS AND PORTABLE CRANES. IN ORDER TO MAKE THE STRUCTURE BULLETPROOF AND PREVENTING IT FROM SINKING, FOAM IS INJECTED INTO THE Floating PART OF THE STRUCTURES. AN ANCHORAGE IS DESIGNED NEAR THE BERTHS FOR THE USE OF MOORING SHIPS. THE STRUCTURE IS DIGITALLY ANALYZED AND PRESENTED IN A 3D MODEL.

شاخص‌های تعامل:   مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

بازدید 292

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resourcesدانلود 0
litScript
telegram sharing button
whatsapp sharing button
linkedin sharing button
twitter sharing button
email sharing button
email sharing button
email sharing button
sharethis sharing button